Undecidable Equivalences for Basic Process Algebra

Undecidable Equivalences for Basic Process Algebra

A recent theorem 3, 7, 19] shows that strong bisimilarity is decidable for the class of normed BPA processes, which correspond to a class of context-free grammars generating the-free context-free languages. In 21] Huynh and Tian have shown that readiness and failure equivalence are undecidable for BPA processes. In this paper we examine all other equivalences in the linear/branching time hierar...

Undecidable Equivalences for Basic Parallel Processes

Article history: Received 10 December 2007 Revised 18 November 2008 Available online 31 January 2009 The trace equivalence of BPP was shown to be undecidable by Hirshfeld. We show that all the preorders and equivalences except bisimulation in Glabbeek’s linear time-branching time spectrum are undecidable for BPP. The results are obtained by extending Hirshfeld’s encoding ofMinskymachines into B...

Equivalences for a biological process algebra

This paper investigates Bio-PEPA, the stochastic process algebra for biological modelling developed by Ciocchetta and Hillston. It focusses on Bio-PEPA with levels where molecular counts are grouped or concentrations are discretised into a finite number of levels. Basic properties of well-defined Bio-PEPA systems are established after which equivalences used for the stochastic process algebra P...

Comparison of Process Algebra Equivalences Using Formats

Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems

Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. Today the main open question in the theory of lossy channel systems is whether bisimulation is decidable. We show that bisimulation, simulation, and in fact all relations between bisimulation and trace inclusion are undecidable for lossy channel systems (and for lossy vector addit...